Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis

نویسندگان

چکیده

Abstract Given a specification as Boolean relation between inputs and outputs, functional synthesis generates function, called Skolem for each output in terms of the such that is satisfied. In general, there may be many possibilities functions satisfying same specification, criteria to pick one or other vary from specification. this paper, we develop technique represent space criteria-agnostic form makes it possible subsequently extract different criteria. Our focus on identifying developing compilation algorithm form. approach based novel counter-example guided strategy existentially quantifying subset variables negation normal We implement compare our performance with those knowledge approaches synthesis, show promising results.

منابع مشابه

Counterexample-Guided Model Synthesis

In this paper we present a new approach for solving quantified formulas in Satisfiability Modulo Theories (SMT), with a particular focus on the theory of fixed-size bit-vectors. We combine counterexampleguided quantifier instantiation with a syntax-guided synthesis approach, which allows us to synthesize both Skolem functions and terms for quantifier instantiations. Our approach employs two gro...

متن کامل

Counterexample-Guided Synthesis of Observation Predicates

We present a novel approach to the safety controller synthesis problem with partial observability for real-time systems. This in general undecidable problem can be reduced to a decidable one by fixing the granularity of the controller: finite sets of clocks and constants in the guards. Current state-of-the-art methods are limited to brute-force enumeration of possible granularities or manual ch...

متن کامل

On Counterexample Guided Quantifier Instantiation for Synthesis in CVC4

We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis conjectures. We also discuss novel counterexample-guided techniques for quantifier instantiation that we use to make finding such proofs practically feasible. A particularly important class of spec...

متن کامل

Counterexample-Guided Quantifier Instantiation for Synthesis in SMT

We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis conjectures. We also discuss novel counterexample-guided techniques for quantifier instantiation that we use to make finding such proofs practically feasible. A particularly important class of spec...

متن کامل

Counterexample Guided Synthesis of Monitors for Realizability Enforcement

Many of today’s software systems are built using distributed services, which evolve in different organizations. In order to facilitate their integration, it is necessary to provide a contract that the services participating in a composition should adhere to. A contract specifies interactions among a set of services from a global point of view. One important problem in a top-down development pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-37706-8_19